package h0909;
/**
  * @description 最长公共子序列问题
  * @author 不知名帅哥
  * @date 2024/9/9 20:35
  * @version 1.0
*/
public class LongestCommonSubstring {
    public static void main(String[] args) {

    }
    public int longestCommonSubsequence(String text1, String text2) {
        int m = text1.length();
        int n=text2.length();
        //dp数组表示text1前i个字符和text2前j个字符的公共子序列长度
        int[][] dp = new int[m+1][n+1];

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (text1.charAt(i)==text2.charAt(j)){
                    dp[i][j]=dp[i-1][j-1]+1;
                }else {
                    dp[i][j]=Math.max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        return dp[m][n];
    }
}
